Daniel Marx

Results: 86



#Item
31

0 Interval Deletion is Fixed-Parameter Tractable ´ YIXIN CAO and DANIEL MARX, Hungarian Academy of Sciences (MTA SZTAKI)

Add to Reading List

Source URL: www.cs.bme.hu

Language: English - Date: 2014-05-06 11:12:07
    32

    Precoloring extension on chordal graphs ´ Daniel Marx Budapest University of Technology and Economics

    Add to Reading List

    Source URL: www.cs.bme.hu

    Language: English - Date: 2007-10-29 10:15:27
      33

      Parameterized complexity of constraint satisfaction problems ´ Daniel Marx Budapest University of Technology and Economics

      Add to Reading List

      Source URL: www.cs.bme.hu

      Language: English - Date: 2007-10-29 10:15:11
        34

        The Closest Substring problem with small distances ´ Daniel Marx

        Add to Reading List

        Source URL: www.cs.bme.hu

        Language: English - Date: 2007-10-29 10:13:17
          35

          Survey of connections between approximation algorithms and parameterized complexity Dániel Marx Humboldt-Universität zu Berlin, Germany Dagstuhl Seminar 11091:

          Add to Reading List

          Source URL: www.cs.bme.hu

          Language: English - Date: 2011-02-28 08:36:55
            36

            List edge multicoloring in bounded cyclicity graphs Dániel Marx Budapest University of Technology and Economics

            Add to Reading List

            Source URL: www.cs.bme.hu

            Language: English - Date: 2007-10-29 10:12:15
              37

              Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams and sphere cut decompositions Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTA

              Add to Reading List

              Source URL: www.cs.bme.hu

              Language: English - Date: 2015-01-20 03:12:51
                38

                Chordal deletion is fixed-parameter tractable ´ Daniel Marx ¨ zu Berlin Humboldt-Universitat

                Add to Reading List

                Source URL: www.cs.bme.hu

                Language: English - Date: 2007-10-29 10:19:01
                  39

                  Important separators and parameterized algorithms Dániel Marx Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary

                  Add to Reading List

                  Source URL: www.cs.bme.hu

                  Language: English - Date: 2013-05-15 08:23:43
                    40

                    The Closest Substring problem with small distances ´ Daniel Marx

                    Add to Reading List

                    Source URL: www.cs.bme.hu

                    Language: English - Date: 2007-10-29 10:14:20
                      UPDATE